Decidable Matching for Convergent Systems
نویسندگان
چکیده
We describe decision procedures for certain classes of semantic matching problems, where the equational theory with respect to which the semantic matching is performed has a convergent rewrite system. We give counterexamples to show that semantic matching becomes undecidable (as it generally is) when the conditions we give are weakened.
منابع مشابه
Semantic Matching in Rewrite Theories
\Semantic matching" is the process of generating a basis set of substitutions (of terms for variables) that makes one term equal to another in a speci ed theory. We restrict ourselves here to matching problems in equational theories that can be presented as programs in the form of convergent rewrite systems, that is, nite sets of equations that compute unique output values when applied (from le...
متن کاملMatching and Uni cation in Rewrite Theories
\Semantic uni cation" is the process of generating a basis set of substitutions (of terms for variables) that makes two given terms equal in a speci ed theory. Semantic uni cation is an important component of some theorem provers. \Semantic matching," a simpler variant of uni cation, where the substitution is made in only one of the terms, has potential usage in programming language interpreter...
متن کاملA Semantic Matching Algorithm : Analysis
A decision procedure for a class of semantic matching problems was proposed in 3], but it yielded eeciency problems, principally because of redundancies. We present in this paper a new semantic matching algorithm for a restricted class of convergent rewrite systems, its theoretical properties, and an eecient implementation. This class of rewrite systems is particularly interesting for functiona...
متن کاملInnnite Convergent String-rewriting Systems and Cross-sections for Monoids
A nitely presented monoid has a decidable word problem if and only if it can be presented by some left-recursive convergent string-rewriting system if and only if it has a recursive cross-section. However, context-free cross-sections or even regular cross-sections do not suuce. This is shown by presenting examples of nitely presented monoids with decidable word problems that do not admit regula...
متن کاملLynch-Morawska Systems on Strings
We investigate properties of convergent and forward-closed string rewriting systems in the context of the syntactic criteria introduced in [8] by Christopher Lynch and Barbara Morawska (we call these LM-Systems). Since a string rewriting system can be viewed as a term-rewriting system over a signature of purely monadic function symbols, we adapt their definition to the string rewriting case. We...
متن کامل